Shape recognition from large image libraries by inexact graph matching

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shape recognition from large image libraries by inexact graph matching

This paper describes a graph-matching technique for recognising line-pattern shapes in large image databases. The methodological contribution of the paper is to develop a Bayesian matching algorithm that uses edge-consistency and node attribute similarity. This information is used to determine the a posteriori probability of a query graph for each of the candidate matches in the database. The n...

متن کامل

Shape Retrieval by Inexact Graph Matching

This paper describes a graph-matching technique for recognising line-pattern shapes in large image databases. The methodological contribution of the paper is to develop a Bayesian matching algorithm that uses edge-consistency and node attribute similarity. This information is used to determine the a posteriori probability of a query graph for each of the candidate matches in the database. The n...

متن کامل

Inexact graph matching using a genetic algorithm for image recognition

Exact graph matching using a genetic algorithm for image recognition has been introduced in previously published work. The algorithm was based on angle matching between two given graphs. It has proven to be quite effective in exact graph matching. However, the algorithm needs some modifications in order to handle cases where the number of nodes, shapes and rotations of the two graphs are differ...

متن کامل

Inexact graph recognition matching for structural pattern

This paper is concerned with the inexact matching of attributed, relational graphs for structural pattern recognition. The matching procedure is based on a state space search utilizing heuristic information. Some experimental results are reported.

متن کامل

Sensitivity Analysis for Graph Matching from Large Structural Libraries

The problem of retrieving a graph from a large structural data-base the most closely resembles a query is a task of pivotal importance. For instance the recognition of relational descriptions of line-patterns is central to the manipulation of large data-bases of both CAD models and structural representations of pictorial shape. From a practical standpoint the di culty stems from the fact that t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition Letters

سال: 1999

ISSN: 0167-8655

DOI: 10.1016/s0167-8655(99)00093-8